Challenges of Symbolic Computation: My Favorite Open Problems
نویسندگان
چکیده
منابع مشابه
Challenges of Symbolic Computation: My Favorite Open Problems
The success of the symbolic mathematical computation discipline is striking. The theoretical advances have been continuous and significant: Gröbner bases, the Risch integration algorithm, integer lattice basis reduction, hypergeometric summation algorithms, etc. From the beginning in the early 60s, it has been the tradition of our discipline to create software that makes our ideas readily avail...
متن کاملChallenges of Symbolic Computation My Favorite Open Problems Y with an Additional Open Problem By
The success of the symbolic mathematical computation discipline is striking. The theoretical advances have been continuous and signiicant: Grr obner, Risch, LLL, WZ, etc. From the beginning in the early 60s, it has been the tradition of our discipline to create software that makes our ideas readily available to scientists, engineers, and educators: SAC-1, Reduce, Macsyma, etc. The commercial vi...
متن کاملChallenges of Symbolic Computation
The success of the symbolic mathematical computation discipline is striking. The theoretical advances have been continuous and significant: Gröbner bases, the Risch integration algorithm, integer lattice basis reduction, hypergeometric summation algorithms, etc. From the beginning in the early 1960s, it has been the tradition of our discipline to create software that makes our ideas readily ava...
متن کاملSome of My Favorite Problems in Ramsey Theory
In this brief note, I will describe a variety of problems from Ramsey theory on which I would like to see progress made. To encourage this progress, I am offering modest rewards for most of these problems. This material is based on a 20-minute talk I gave at the meeting in Carrollton. AMS Mathematics Subject Classification: 05D10
متن کاملSymbolic computation of the Duggal transform
Following the results of cite{Med}, regarding the Aluthge transform of polynomial matrices, the symbolic computation of the Duggal transform of a polynomial matrix $A$ is developed in this paper, using the polar decomposition and the singular value decomposition of $A$. Thereat, the polynomial singular value decomposition method is utilized, which is an iterative algorithm with numerical charac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2000
ISSN: 0747-7171
DOI: 10.1006/jsco.2000.0370